#include <algorithm>
#include <iostream>
using namespace std;
const int maxn = 10;
int buff[maxn], len, N;
void dfs(int total, int now)
{
    if (total > N)
        return;
    if (total == N)
    {
        for (int i = 0; i < len; ++i)
        {
            if (i < len - 1)
                printf("%d+", buff[i]);
            else
                printf("%d\n", buff[i]);
        }
        return;
    }
    for (int i = now; i < N; ++i)
    {
        buff[len++] = i;
        dfs(total + i, i);
        len--;
    }
}
int main()
{
    cin >> N;
    dfs(0, 1);
    return 0;
}